A Modi ed Hausdor Distance for Object Matching

نویسندگان

  • Marie-Pierre Dubuisson
  • Anil K. Jain
چکیده

The purpose of object matching is to decide the similarity between two objects. This paper introduces 24 possible distance measures based on the Hausdor distance between two point sets. These measures can be used to match two sets of edge points extracted from any two objects. Based on our experiments on synthetic images containing various levels of noise, we determined that one of these distance measures, called the modi ed Hausdor distance (MHD) has the best performance for object matching. The advantages of MHD over other distances are also demonstrated on several edge maps of objects extracted from real images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SERIE B INFORMATIK Approximate Matching of Polygonal Shapes

For two given simple polygons P Q the problem is to determine a rigid motion I of Q giving the best possible match between P and Q i e minimizing the Hausdor distance between P and I Q Faster algorithms as the one for the general problem are obtained for special cases namely that I is restricted to translations or even to translations only in one speci ed direction It turns out that determining...

متن کامل

A Modi ed Fourier Descriptor for Shape Matching in MARS

We propose a Modi ed Fourier Descriptor and a new dis tance measure for describing and comparing closed planar curves Our method accounts for spatial discretization of shapes an issue seldom mentioned much less addressed in the literature The motivating application is shape matching in the Multimedia Analysis and Retrieval System MARS our content based image retrieval system The application req...

متن کامل

Fuzzy Relational Distance for Large-Scale Object Recognition

This paper presents a new similarity measure for object recognition from large libraries of line-patterns. The measure draws its inspiration from both the Hausdor distance and a recently reported Bayesian consistency measure that has been sucessfully used for graphbased correspondence matching. The measure uses robust error-kernels to gauge the similarity of pairwise attribute relations de ned ...

متن کامل

Object Tracking Using Motion Direction Detection

We present an algorithm for tracking objects in a video sequence, based on a novel approach for motion detection. We do not estimate the velocity eld. Instead we detect only the direction of motion at edge points and thus isolate sets of points which are moving coherently. We use a Hausdor distance based matching algorithm to match point sets in local neighborhood and thus track objects in a vi...

متن کامل

Geometric Pattern Matching in d-Dimensional Space

We show that, using the L 1 metric, the minimum Hausdor distance under translation between two point sets of cardinality n in d-dimensional space can be computed in time O(n (4d 2)=3 log 2 n) for 3 < d 8, and in time O(n 5d=4 log 2 n) for any d > 8. Thus we improve the previous time bound of O(n 2d 2 log 2 n) due to Chew and Kedem. For d = 3 we obtain a better result of O(n 3 log 2 n) time by e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994